Computation of Minimum Energy Paths for Quasi-Linear Problems

نویسندگان

  • Jeremy Chamard
  • Josef Otta
  • David J. B. Lloyd
چکیده

We investigate minimum energy paths of the quasi-linear problem with the p-Laplacian operator and a double-well potential. We adapt the String method of E., Ren, and Vanden-Eijnden (J. Chem. Phys., vol. 126 2007) to locate saddle-type solutions. In one-dimension, the String method is shown to find a minimum energy path that can align along one-dimensional “ridges” of saddle-continua. We then apply the same method to locate saddle solutions and transition paths of the two-dimensional quasi-linear problem. The method developed is applicable to a general class of quasi-linear PDEs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

متن کامل

A Modification on Applied Element Method for Linear Analysis of Structures in the Range of Small and Large Deformations Based on Energy Concept

In this paper, the formulation of a modified applied element method for linear analysis of structures in the range of small and large deformations is expressed. To calculate deformations in the structure, the minimum total potential energy principle is used. This method estimates the linear behavior of the structure in the range of small and large deformations, with a very good accuracy and low...

متن کامل

Holiest Minimum-Cost Paths and Flows in Surface Graphs

Let G be an edge-weighted directed graph with n vertices embedded on an orientable surface of genus g. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest paths in G. The perturbations take O(gn) time to compute. We use our perturbation scheme in a black box manner to derive a deterministic O(n log log n) time algori...

متن کامل

Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs

A digraph D is called quasi-transitive if for any triple x, y, z of distinct vertices of D such that (x, y) and (y, z) are arcs of D there is at least one arc from x to z or from z to x. A minimum path factor of a digraph D is a collection of the minimum number of pairwise vertex disjoint paths covering the vertices of D. J. Bang-Jensen and J. Huang conjectured that there exist polynomial algor...

متن کامل

Holiest Minimum-Cost Paths and Flows in Surface Graphs⇤ (full version)

Let G be an edge-weighted directed graph with n vertices embedded on a surface of genus g. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest paths in G. The perturbations take O(gn) time to compute. We use our perturbation scheme in a black box manner to derive a deterministic O(n log log n) time algorithm for mini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Sci. Comput.

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2011